On the Search Properties of Different Crossover Operators in Genetic Programming
نویسنده
چکیده
ABSTRACT In this paper we study and compare the search properties of different crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic material exchanged between the parents to generate the offspring. These operators are: standard crossover, onepoint crossover and a new operator, uniform crossover. Our analysis suggests that standard crossover is a local and biased search operator not ideal to explore the search space of programs effectively. One-point crossover is better in some cases as it is able to perform a global search at the beginning of a run, but it suffers from the same problems as standard crossover later on. Uniform crossover largely overcomes these limitations as it is global and less biased.
منابع مشابه
On the Ability to Search the Space of Programs of Standard, One-point and Uniform Crossover in Genetic Programming
In this paper we study and compare the search properties of diierent crossover operators in genetic programming (GP) using probabilistic models and experiments to assess the amount of genetic material exchanged between the parents to generate the oospring. These operators are: standard crossover, one-point crossover and a new operator, uniform crossover. Our analysis suggests that standard cros...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملNovel Knowledge Based Tabu Crossover In Genetic Algorithms
Genetic algorithms are optimisation algorithms and mimic the natural process of evolution. Important operators used in genetic algorithms are selection, crossover and mutation. Selection operator is used to select the individuals from a population to create a mating pool which will participate in reproduction process. Crossover and mutation operators are used to introduce diversity in the popul...
متن کاملUsing Subtree Crossover Distance to Investigate Genetic Programming Dynamics
To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance measures can make this analysis more accurate and reliable than using distance measures which have no relationship with the genetic operators. This paper extends a recent definition of a distance measure based on subtree crossove...
متن کامل